Dialetheic truth theory: inconsistency, non-triviality, soundness, incompleteness
نویسنده
چکیده
The best-known application of dialetheism is to semantic paradoxes such as the Liar. In particular, Graham Priest has advocated the adoption of an axiomatic truth theory in which contradictions arising from the Liar paradox can be accepted as theorems, while the Liar sentence itself is evaluated as being both true and false. Such eccentricities might be tolerated, in exchange for great rewards. But in this note I show that it is not possible in Priest’s truth theory to express certain semantic facts about that very theory, and thus that it enjoys no definite advantage over more orthodox approaches to semantic paradox.
منابع مشابه
A Note concerning the Place of Contradictions in the Ontologies of Constitution
In this first section we start with defining the notions of inconsistency and para-consistency, we give an example of an inconsistency and clarify what according to us is the basic problem with respect to the occurrence of inconsistencies. We are then in a position to state the aim of this paper. We have a contradiction when both A and ∼ A are true.1 We have negation-incompleteness when neither...
متن کاملNon-monotonic set theory as a pragmatic foundation of mathematics∗
In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I present two completely different methods to develop set theories based on adaptive logics. For both theories there is a finitistic non-triviality proof and both theories contain (a subtle version of) the comprehension axiom schema. The first theory contains only a maximal selection of instances ...
متن کاملIncompleteness and Undecidability of Predicate Logic
Theorem 1.1 Soundness If Γ ` φ, then Γ |= φ Completeness If Γ |= φ, then Γ ` φ We recall that ` refers to derivability e.g. in the natural deduction system of predicate logic as given in [1]. We also recall that |= refers to truth in all models: for all models (of the right signature) M, if all formulas of Γ are true in M, then φ is true in M. The completeness referred to above is also called s...
متن کاملGödel-Rosser's Incompleteness Theorem, generalized and optimized for definable theories
Gödel’s First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a syntactic-semantic notion (that is the consistency of a theory with the set of all true Πn sentences or equivalently the Σn soundness of the theory) that corresponds to Gödel’s notion of ω-consistency in an appropriate way. It is also shown that Rosser’s Incomp...
متن کاملConsequence & Inference
Logic is usually considered to be the study of logical consequence – of the most basic laws governing how a statement’s truth depends on the truth of other statements. Some of the pioneers of modern formal logic, notably Hilbert and Carnap, assumed that the only way to get hold of the relation of consequence was to reconstruct it as a relation of inference within a formal system built upon expl...
متن کامل